STRONG MINIMALITY AND THE j-FUNCTION
نویسنده
چکیده
We show that the order three algebraic differential equation over Q satisfied by the analytic j-function defines a non-א0-categorical strongly minimal set with trivial forking geometry relative to the theory of differentially closed fields of characteristic zero answering a long-standing open problem about the existence of such sets. The theorem follows from Pila’s modular Ax-Lindemann-Weierstrass with derivatives theorem using Seidenberg’s embedding theorem and a theorem of Nishioka on the differential equations satisfied by automorphic functions. As a by product of this analysis, we obtain a more general version of the modular Ax-Lindemann-Weierstrass theorem, which, in particular, applies to automorphic functions for arbitrary arithmetic subgroups of SL2(Z). We then apply the results to prove effective finiteness results for intersections of subvarieties of products of modular curves with isogeny classes. For example, we show that if ψ : P → P is any non-identity automorphism of the projective line and t ∈ A(C) r A(Q), then the set of s ∈ A(C) for which the elliptic curve with j-invariant s is isogenous to the elliptic curve with j-invariant t and the elliptic curve with j-invariant ψ(s) is isogenous to the elliptic curve with j-invariant ψ(t) has size at most 36. In general, we prove that if V is a Kolchin-closed subset of A, then the Zariski closure of the intersection of V with the isogeny class of a tuple of transcendental elements is a finite union of weakly special subvarieties. We bound the sum of the degrees of the irreducible components of this union by a function of the degree and order of V .
منابع مشابه
Vc-minimality: Examples and Observations
VC-minimality is a recent notion in model theory which generalizes strong minimality, o-minimality, weak o-minimality and c-minimality, but is strong enough to imply various other properties of interest such as NIP and dp-minimality. In this paper, we answer several questions posed by Adler about the relationship of VC-minimality and older stability-theoretic notions in model theory. We also gi...
متن کاملRegularisable and Minimal Orbits for Group Actions in Infinite Dimensions
We introduce a class of regularisable infinite dimensional principal fibre bundles which includes fibre bundles arising in gauge field theories like Yang-Mills and string theory and which generalise finite dimensional Riemannian principal fibre bundles induced by an isometric action. We show that the orbits of regularisable bundles have well defined, both heat-kernel and zeta function regularis...
متن کاملNotes on o-minimality and variations
The article surveys some topics related to o-minimality, and is based on three lectures. The emphasis is on o-minimality as an analogue of strong minimality, rather than as a setting for the model theory of expansions of the reals. Section 2 gives some basics (the Monotonicity and Cell Decomposition Theorems) together with a discussion of dimension. Section 3 concerns the Peterzil–Starchenko Tr...
متن کاملHarmonicity and Minimality of Vector Fields on Lorentzian Lie Groups
We consider four-dimensional lie groups equipped with left-invariant Lorentzian Einstein metrics, and determine the harmonicity properties of vector fields on these spaces. In some cases, all these vector fields are critical points for the energy functional restricted to vector fields. We also classify vector fields defining harmonic maps, and calculate explicitly the energy of t...
متن کاملA monotonicity theorem for dp-minimal densely ordered groups
Dp-minimality is a common generalization of weak minimality and weak o-minimality. If T is a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal densely ordered groups that are not weakly o-minimal. We introduce the even more general notion of inpminimality and prove that in an inp-minimal densely ordered group, every definable unary function is a union of finitel...
متن کاملMulti-agent scheduling on a single machine with max-form criteria
We consider multi-agent scheduling on a single machine, where the objective functions of the agents are of the max-form. For the feasibility model, we show that the problem can be solved in polynomial time even when the jobs are subject to precedence restrictions. For the minimality model, we show that the problem is strongly NP-hard in general, but can be solved in pseudo-polynomial time when ...
متن کامل